Generation of address sequences with specified switching activity and address repeatability

Objectives. The problem of developing a methodology for generating address sequences with given switching activity and repeatability addresses widely used in testing modern computing systems is being solved. relevance this lies the fact that main characteristic difference their effectiveness both individual bits sequences. Methods. Presented results are based on universal method quasi-random Sobol sequences, which effectively to generate targeted test As an initial mathematical model, modification indicated generation proposed by Antonov Saleev used. idea approach use rectangular (m + k) × m matrices V arbitrary rank r Results. properties generated accordance new model determined. A number statements substantiate requirements generator ensure maximum period multiplicity repetition addresses. synthesizing values F(A) F(a i ) It shown order find matrix such it necessary solve decomposing integer into terms. This decomposition represents value k)-ary mixed system, weights digits represented as powers two from 2 0 m+k-1 , w(vi) lie range m+k-1. On basis restrictions, notion diagram similar Young introduced, operation its defined. Conclusion. expands possibilities required sets bits. non-maximal makes possible formalize even